Category Theory in Coq 8.5
نویسندگان
چکیده
We report on our experience implementing category theory in Coq 8.5 . The repository of this development can be found at https://bitbucket.org/amintimany/ categories/. This implementation most notably makes use of features primitive projections for records and universe polymorphism that are new to Coq 8.5. The latter provides relative smallness and largeness in the development. This will be elaborated below. The former allows for specification of well-behaved dualities in the category theoretical sense. That is, we get definitional equalities such as:
منابع مشابه
Experience Implementing a Performant Category-Theory Library in Coq
We describe our experience implementing a broad categorytheory library in Coq. Category theory and computational performance are not usually mentioned in the same breath, but we have needed substantial engineering effort to teach Coq to cope with large categorical constructions without slowing proof script processing unacceptably. In this paper, we share the lessons we have learned about how to...
متن کاملA Coq Formalization of Finitely Presented Modules
This paper presents a formalization of constructive module theory in the intuitionistic type theory of Coq. We build an abstraction layer on top of matrix encodings, in order to represent finitely presented modules, and obtain clean definitions with short proofs justifying that it forms an abelian category. The goal is to use it as a first step to get certified programs for computing topologica...
متن کاملCategorical semantics of programming languages (in COQ)
Formalized mathematics have met an increasing interest in the last years. They give a way to build digital searchable libraries of mathematics, and computerverified proofs allow for a level of trust in the theory which the pen and paper versions cannot supply. Our first goal is to build a library of category theory [2] in the proof assistent COQ [1]. A comprehensive library surely demands more ...
متن کاملDeveloping the Algebraic Hierarchy with Type Classes in Coq
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach addresses both traditional challenges as well as new ones resulting from our ambition to build upon this development a library of constructive analysis in which abstraction penalties inhibiting efficient computation are ...
متن کاملInitial Semantics for higher-order typed syntax in Coq
Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed syntax with variable binding together with its formalization in the Coq proof assistant. The main theorem was first proved on paper in the second author’s PhD thesis in 2010, and verified formally shortly afterwards. To a simply–t...
متن کامل